Degrees giving independent edges in a hypergraph
نویسندگان
چکیده
منابع مشابه
Sets of Independent Edges of a Hypergraph
GIVEN a set X and a natural number r denote by X(r) the set of relement subsets of X. An r-graph or hypergraph G is a pair (V, T), where V is a finite set and T c V(r) . We call v E V a vertex of G and z cT an r-tuple or an edge of G . Thus a 1-graph is a set V and a subset T of V. As the structure of 1-graphs is trivial, throughout the note we suppose r > 2. A 2-graph is a graph in the sense o...
متن کاملA note on approximate strengths of edges in a hypergraph
Let H = (V, E) be an edge-weighted hypergraph of rank r. Kogan and Krauthgamer [7] extended Benczúr and Karger’s [2] random sampling scheme for cut sparsification from graphs to hypergraphs. The sampling requires an algorithm for computing the approximate strengths of edges. In this note we extend the algorithm for graphs from [2] to hypergraphs and describe a near-linear time algorithm to comp...
متن کاملA Problem on Complements and Disjoint Edges in a Hypergraph
Let KN denote the complete k-graph on N vertices, that is, the k-uniform hypergraph whose edges are the (k) k-subsets of a set of N vertices . The Ramsey number of a pair of k-graphs is defined as for graphs in terms of the 2-colorings of the k-sets which are the edges of a complete k-graph . Let sKk denote a k-graph which is a matching with s edges . That is, sKk has sk vertices and s edges, n...
متن کاملDegrees of M-fuzzy families of independent L-fuzzy sets
The present paper studies fuzzy matroids in view of degree. First wegeneralize the notion of $(L,M)$-fuzzy independent structure byintroducing the degree of $M$-fuzzy family of independent $L$-fuzzysets with respect to a mapping from $L^X$ to $M$. Such kind ofdegrees is proved to satisfy some axioms similar to those satisfiedby $(L,M)$-fuzzy independent structure. ...
متن کاملHypergraph Independent Sets
The study of extremal problems related to independent sets in hypergraphs is a problem that has generated much interest. While independent sets in graphs are defined as sets of vertices containing no edges, hypergraphs have different types of independent sets depending on the number of vertices from an independent set allowed in an edge. We say that a subset of vertices is jindependent if its i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1981
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700006924